From imperative to rule-based graph programs

From imperative to rule-based graph programs

The use of graphs to model dynamic structures is ubiquitous in computer science; prominent example areas include compiler construction, pointer programming, natural language processing, and model-driven software development. The behaviour of systems in such areas can be naturally captured by graph transformation rules specifying small state changes. Domain-specific languages based on graph tran...

Runtime verification of programs using rule-based active system

From Graph Transformation to Rule-Based Programming with Diagrams

Graph transformation is a well studied computational model for speciication and programming. In this paper we outline a path that can be taken in order to turn graph transformation into a rule-based language for programming with diagrams. In particular, we discuss how data abstraction and functional abstraction can be achieved in the setting of graphs, by minimal extensions of the underlying gr...

Generating Algebraic Laws from Imperative Programs

The use of veri ers for proving the correctness of concrete programs is well known and has been amply described in the literature Here we focus on further perhaps more general tasks such veri ers can perform Given a program that is assumed to be correct we derive a set of axioms for the data structures involved In the simplest case we study an abstract program interchanging the contents of two ...

Graph-based Rule Editor

In this paper we present a prototypical implementation of a graphical tool for creating rules. This tool uses a graph-based Palantir tool environment as a user interface to model rule conditions and conclusions. It is also used to visualize data and results of reasoning. We present a process of converting graph models stored in an XML format file into the Jess knowledge base and rules. Results ...